A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
نویسندگان
چکیده
“Bin packing with rejection” is the following problem: Given a list of items with associated sizes and rejection costs, find a packing into unit bins of a subset of the list such that the number of bins used plus the sum of rejection costs of unpacked items is minimized. We show that bin packing with rejection can be reduced to n multiple knapsack problems and, based on techniques for the multiple knapsack problem, we give a fast asymptotic polynomial time approximation scheme,“Reject&Pack”, with time complexity O(nO(ε )). This improves a recent approximation scheme given by Epstein, which has time complexity O(nO((ε −4)ε −1 )). We also show that Reject&Pack can be extended to variable-sized bin packing with rejection and give an asymptotic polynomial time approximation scheme. c © 2007 Elsevier B.V. All rights reserved.
منابع مشابه
Bin packing with general cost structures
Following the work of Anily et al., we consider a variant of bin packing, called BIN PACKING WITH GENERAL COST STRUCTURES (GCBP) and design an asymptotic fully polynomial time approximation scheme (AFPTAS) for this problem. In the classic bin packing problem, a set of one-dimensional items is to be assigned to subsets of total size at most 1, that is, to be packed into unit sized bins. However,...
متن کاملAFPTAS results for common variants of bin packing: A new method to handle the small items
We consider two well-known natural variants of bin packing, and show that these packing problemsadmit asymptotic fully polynomial time approximation schemes (AFPTAS). In bin packing problems,a set of one-dimensional items of size at most 1 is to be assigned (packed) to subsets of sum at most1 (bins). It has been known for a while that the most basic problem admits an AFPTAS. In this...
متن کاملAn Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering
In the bin covering problem there is a group L=(a1; : : : ; an) of items with sizes s̃(ai)∈ (0; 1), and the goal is to 6nd a packing of the items into bins to maximize the number of bins that receive items of total size at least 1. This is a dual problem to the classical bin packing problem. In this paper we present the 6rst asymptotic fully polynomial-time approximation scheme for the problem. ...
متن کاملAn asymptotic approximation scheme for the concave cost bin packing problem
We consider a generalized one-dimensional bin packing model in which the cost of a bin is a nondecreasing concave function of the utilization of the bin. We show that for any given positive constant , there exists a polynomial-time approximation algorithmwith an asymptotic worst-case performance ratio of no more than 1 + .
متن کاملA New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
In this paper we introduce a new general approximation method for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programming (LP) relaxation, leading to a partial integer solution, and the application of a wellbehaved approximation algorithm to complete this solution. If the value of the solution returned by the latter can be ...
متن کامل